Consensus Formation in Networked Groups

نویسنده

  • Carlo Martini
چکیده

This paper applies the theory of networks to the problem of how agents should assign weights to other agents in the Lehrer-Wagner model for consensus formation. The LehrerWagner theory of consensus is introduced, and the problem of weight assignment is highlighted as one of the open problems for the theory. The paper argues that the application of the theory of networks to the Lehrer-Wagner model constitutes an interesting and fruitful option, among others, for the problem of weight assignment. 1 Social epistemology and consensus models How consensus is formed, that is how situations of disagreement are resolved, is a central topic in social epistemology. Traditionally, epistemologists have been concerned, among other topics, with the problems related to belief formation from an individual perspective, but there is also a very important social dimension to that phenomenon. The idea that group judgment has important epistemic advantages over individual judgment has been treated from numerous perspectives, although the formal treatment of the problem dates back to only a few centuries, with the marquis de Condorcet and the now renown theorem named after him, the Condorcet jury theorem (see List and Goodin 2001; Young 1988). Since then, research in social choice theory, psychology, and social epistemology has highlighted the epistemic advantages as well as disadvantages of group deliberation and group decision making (see Kitcher 1990; Aaken et al. 2004; Goldman 1999). ∗Tilburg Center for Logic and Philosophy of Science, Tilburg University, PO Box 90153, 5000 LE, Tilburg (The Netherlands) http://www.martinicarlo.net [email protected].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Decentralized Control of Networked Systems for Setpoint Tracking

Decentralized control of networked systems has been widely addressed in the last few years. Main application fields include, for instance, multi–robot systems, distributed sensor networks and interconnected manufacturing equipments. Generally speaking, the aim of decentralized control strategies is implementing local interaction rules to regulate the state of the overall system to some desired ...

متن کامل

On Formation Control of Networked Multi-agent Systems

In this paper, a systematic framework is developed for the consensus problem, in particular, for formation control of networked dynamic agents. In view of the complexity of the framework with switching coupling topology and nonlinearity, a new decentralized formation strategy based on artificial potential functions (APF) is proposed. Due to the existence of local minima in the APF, the formatio...

متن کامل

Formation Control of Nonholonomic Multi-Vehicle Systems via Virtual Structure

This paper deals with formation control strategies based on Virtual Structure (VS) for multi-vehicle systems. We propose several control laws for networked multi-nonholonomic vehicle systems in order to achieve VS consensus, VS Flocking and VS Flocking with collision avoidance. First, Virtual Vehicle for the feedback linearization is considered, and we propose VS consensus and Flocking control ...

متن کامل

Formation Control of Nonholonomic Multi-Vehicle Systems Based on Virtual Structure

This paper deals with formation control strategies based on Virtual Structure (VS) for multi-vehicle systems. We propose several control laws for networked multi-nonholonomic vehicle systems in order to achieve VS consensus, VS Flocking and VS Flocking with collisionavoidance. First, Virtual Vehicle for the feedback linearization is considered, and we propose VS consensus and Flocking control l...

متن کامل

Networked Multi-agent Systems: from Real Laplacian to Complex Laplacian

EXTENDED ABSTRACT. In recent years, networked multi-agent systems have attracted much research attention from various disciplines of engineering and science due to their interdisciplinary nature and broad potential applications. Collective behaviors arise from simple local interaction rules in complex networked systems. Graph Laplacian plays a very important role in analysis of networked multi-...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010